Search Results

  1. A. Penttinen, I. Koutsopoulos and L. Tassiulas, Low-complexity distributed fair scheduling for wireless multi-hop networks, in Proceedings of 1st workshop on Resource Allocation in Wireless NETworks (RAWNET 2005), 2005 (pdf)(bib)
    Abstract: Max-min fair bandwidth allocation is a meaningful objective whenever the level of user satisfaction cannot be clearly expressed as a function of the allocated bandwidth. In this work, we address the issue of approximating max-min fairness in a wireless network without the requirement for network-wide node coordination and we present a low-overhead greedy distributed algorithm for reaching this goal. The algorithm is based on distributed computation of a maximum weighted matching based on appropriately defined flow weights and subsequent scheduling of link flows in an effort to provide max-min rates to them. An inherent feature of our approach is its immunity to topology changes as well as to flow traffic variations. Our method is shown to outperform significantly the centralized (yet, conservative) algorithm of max-min fair rate computation in general topologies in terms of total resulting throughput, minimum shares and node resource utilization.